Algebraic Domain Decomposition Methods for Highly Heterogeneous Problems
نویسندگان
چکیده
We consider the solving of linear systems arising from porous media flow simulations with high heterogeneities. Using a Newton algorithm to handle the non-linearity leads to the solving of a sequence of linear systems with different but similar matrices and right hand sides. The parallel solver is a Schwarz domain decomposition method. The unknowns are partitioned with a criterion based on the entries of the input matrix. This leads to substantial gains compared to a partition based only on the adjacency graph of the matrix. From the information generated during the solving of the first linear system, it is possible to build a coarse space for a two-level domain decomposition algorithm that leads to an acceleration of the convergence of the subsequent linear systems. We compare two coarse spaces: a classical approach and a new one adapted to parallel implementation.
منابع مشابه
Optimized algebraic interface conditions in domain decomposition methods for strongly heterogeneous unsymmetric problems
Under classical assumptions on the coefficients of the problem (e.g. η − 1 2divb > 0 a.e. in Ω) the matrix A in (2) is definite positive. We solve problem (2) by means of an Optimized Schwarz Method: such methods have been introduced at the continuous level in [4], and at the discrete level in [5]. We design optimized interface conditions directly at the algebraic level, in order to guarantee r...
متن کاملA Two-Level Schwarz Preconditioner for Heterogeneous Problems
Coarse space correction is essential to achieve algorithmic scalability in domain decomposition methods. Our goal here is to build a robust coarse space for Schwarz–type preconditioners for elliptic problems with highly heterogeneous coefficients when the discontinuities are not just across but also along subdomain interfaces, where classical results break down [3, 6, 15, 9]. In previous work, ...
متن کاملRobust Domain Decomposition Algorithms for Multiscale PDEs
In this paper we describe a new class of domain deomposition preconditioners suitable for solving elliptic PDEs in highly fractured or heterogeneous media, such as arise in groundwater flow or oil recovery applications. Our methods employ novel coarsening operators which are adapted to the heterogeneity of the media. In contrast to standard methods (based on piecewise polynomial coarsening), th...
متن کاملOverlapping Domain Decomposition Algorithms for General Sparse Matrices
Domain decomposition methods for Finite Element problems using a partition based on the underlying nite element mesh have been extensively studied In this paper we discuss algebraic extensions of the class of overlapping domain decomposition algorithms for general sparse matrices The subproblems are created with an overlapping partition of the graph corresponding to the sparsity structure of th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- SIAM J. Scientific Computing
دوره 35 شماره
صفحات -
تاریخ انتشار 2013